Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms

نویسنده

  • Jacques Patarin
چکیده

In [6] T. Matsumoto and H. Imai described a new asymmetric algorithm based on multivariate polynomials of degree two over a finite field, which was subsequently broken in 191. Here we present two new families of Asymmetric Algnrithrrrs t,liat so far have resisted all attacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP). These algorithms can be seen as two candidate ways to repair the Matsumoto-Imai Algorithm. HFE can be used to do signatures, encryption or authenticat<ion in an asyrrirrietric way, with very short signatures and short encryptions of short messages. IP can be used for signatures and for zero knowledge aut,hent,icatinn. An extended version of this paper can be obtained from the author. Ariot,her way to repair the Matsumot,o-Irnai Algorithm will be presented in [lo].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms

In [11] T. Matsumoto and H. Imai described a new asymmetric algorithm based on multivariate polynomials of degree two over a nite eld. Then in [14] this algorithm was broken. The aim of this paper is to show that despite this result it is probably possible to use multivariate polynomials of degree two in carefully designed algorithms for asymmetric cryptography. In this paper we will give some ...

متن کامل

Hidden Field Equations (hfe) and Isomorphisms of Polynomials (ip): Two New Families of Asymmetric Algorithms -extended Version

In 11] T. Matsumoto and H. Imai described a new asymmetric algorithm based on multivariate polynomials of degree two over a nite eld. Then in 14] this algorithm was broken. The aim of this paper is to show that despite this result it is probably possible to use multivariate polynomials of degree two in carefully designed algorithms for asymmetric cryptography. In this paper we will give some ex...

متن کامل

A Note on a Class of Quadratic Permutations over F2n

1 Finding new classes of permutation polynomials is a chal-lenging problem with applications in cryptography, coding theory andin combinatorial designs [1]. We will here focus on a specific instanceraised by Patarin in his paper introducig HFE [2], namely characterizingquadratic permutation polynomials. After a survey of existing results, wewill present our extension of some...

متن کامل

Improved Algorithms for Isomorphisms of Polynomials { Extended Version {

This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were rst explicitly related to the problem of nding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C scheme of 13], or some variations of Patarin's HFE scheme of 15]). Moreover, in 15], it was shown that IP can be used in order to des...

متن کامل

Improved Algorithms for Isomorphisms of Polynomials { Extended

This paper is about the design of improved algorithms to solve Isomorphisms of Polynomials (IP) problems. These problems were rst explicitly related to the problem of nding the secret key of some asymmetric cryptographic algorithms (such as Matsumoto and Imai's C scheme of 13], or some variations of Patarin's HFE scheme of 15]). Moreover, in 15], it was shown that IP can be used in order to des...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996